翻訳と辞書 Words near each other ・ Monochroa servella ・ Monochroa simplicella ・ Monochroa sperata ・ Monochroa subcostipunctella ・ Monochroa suffusella ・ Monochroa tenebrella ・ Monochroa tetragonella ・ Monochroa uralensis ・ Monochroides ・ Monochrom ・ Monochroma ・ Monochromacy ・ Monochromatic chess ・ Monochromatic color ・ Monochromatic electromagnetic plane wave ・ Monochromatic triangle ・ Monochromatic wavelength dispersive x-ray fluorescence ・ Monochromator ・ Monochrome ・ Monochrome (Ammonia song) ・ Monochrome (disambiguation) ・ Monochrome (Helmet album) ・ Monochrome (Helmet song) ・ Monochrome (Lee Hyori album) ・ Monochrome BBS ・ Monochrome Effect ・ Monochrome Factor ・ Monochrome Letter ・ Monochrome monitor ・ Monochrome painting Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Monochromatic triangle ： ウィキペディア英語版 Monochromatic triangle In graph theory and theoretical computer science, the monochromatic triangle problem is an algorithmic problem on graphs, in which the goal is to partition the edges of a given graph into two triangle-free subgraphs. It is NP-complete but fixed-parameter tractable on graphs of bounded treewidth. ==Problem statement== The monochromatic triangle problem takes as input an n-node undirected graph G(V,E) with node set V and edge set E. The output is a Boolean value, true if the edge set E of G can be partitioned into two disjoint sets E1 and E2, such that both of the two subgraphs G1(V,E1) and G2(V,E2) are triangle-free graphs, and false otherwise. This decision problem is NP-complete.〔. A1.1: GT6, pg.191.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Monochromatic triangle」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.